Fast global stereo matching via energy pyramid minimization
نویسندگان
چکیده
We define a global matching framework based on energy pyramid, the Global Matching via Energy Pyramid (GM-EP) algorithm, which estimates the disparity map from a single stereo-pair by solving an energy minimization problem. We efficiently address this minimization by globally optimizing a coarse to fine sequence of sparse Conditional Random Fields (CRF) directly defined on the energy. This global discrete optimization approach guarantees that at each scale we obtain a near optimal solution, and we demonstrate its superiority over state of the art image pyramid approaches through application to real stereo-pairs. We conclude that multiscale approaches should be build on energy pyramids rather than on image pyramids.
منابع مشابه
Stereo Matching by Joint Energy Minimization
In [7], Mozerov et al. propose to perform stereo matching as a twostep energy minimization problem. They formulate cost filtering as a local energy minimization model, and solve the fully connected MRF model and the locally connected MRF model sequentially. In this paper we intend to combine the two steps of energy minimization in order to improve stereo matching results. We propose to jointly ...
متن کاملOcclusion and Error Detection for Stereo Matching and Hole-Filling Using Dynamic Programming
Occlusion is the key and challenging problem in stereo matching, because the results from depth maps are significantly influenced by occlusion regions. In this paper, we propose a method for occlusion and error regions detection and for efficient holefilling based on an energy minimization. First, we implement conventional global stereo matching algorithms to estimate depth information. Exploit...
متن کاملStereo Video Disparity Estimation Using Multi-wavelets
Disparity estimation in stereo video processing is a crucial step in the generation of a 3D view of a scene. In this paper, a multi-wavelet based stereo correspondence matching technique for video is proposed. A multi-wavelet transform is first applied to a pair of stereo frames. Correspondence matching is initially performed at the coarsest level and relies on coarse-to-fine refinement in orde...
متن کاملFast Segmentation-based Dense Stereo from Quasi-dense Matching
We propose a segmentation-based dense stereo algorithm within an energy minimization framework. The cost function includes a new consistency term to take into account an initial quasi-dense disparity map and handles occlusions explicitly. Based on quasi-dense matching and color segmentation, optimization is performed efficiently by assuming a constant disparity for each region. The assumption i...
متن کاملRules for the Use of Theses
OF THESIS 3D RECONSTRUCTION FROM STEREO/RANGE IMAGES. 3D reconstruction from stereo/range image is one of the most fundamental and extensively researched topics in computer vision. Stereo research has recently experienced somewhat of a new era, as a result of publically available performance testing such as the Middlebury data set, which has allowed researchers to compare their algorithms again...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014